Title: Logic of Constraints: A Quantitative Performance and Functional Constraint Formalism
نویسنده
چکیده
In the era of billion-transistor design, it is critical to establish effective verification methodologies from the system level all the way down to the implementations. In this paper, we introduce Logic of Constraints (LOC), a logic that is particularly suited to express quantitative performance constraints as well as functional constraints. We analyze the expressiveness of LOC and show that it is important and different from Linear Temporal Logic (LTL), on which traditional hardware assertion languages (e.g. PSL and OpenVera) are based. We propose an automatic simulation trace checking/runtime monitoring methodology that can be used to verify system designs very efficiently. Since a subset of LOC is decidable, we also discuss the formal verification approach for LOC formulas. Through several industrial case studies, we demonstrate the usefulness of the LOC formalism and the corresponding simulation and verification approach at the higher, transaction level of abstraction.
منابع مشابه
Deductive Planning with Temporal Constraints
Temporal Action Logic is a well established logical formalism for reasoning about action and change using an explicit time representation that makes it suitable for applications that involve complex temporal reasoning. We take advantage of constraint satisfaction technology to facilitate such reasoning through temporal constraint networks. Extensions are introduced that make generation of actio...
متن کاملA Robust Discrete FuzzyP+FuzzyI+FuzzyD Load Frequency Controller for Multi-Source Power System in Restructuring Environment
In this paper a fuzzy logic (FL) based load frequency controller (LFC) called discrete FuzzyP+FuzzyI+FuzzyD (FP+FI+FD) is proposed to ensure the stability of a multi-source power system in restructured environment. The whale optimization algorithm (WOA) is used for optimum designing the proposed control strategy to reduce fuzzy system effort and achieve the best performance of LFC task. Further...
متن کاملNon-Monotonic Reasoning with Quantified Boolean Constraints
In this paper, we define and investigate the complexity of several nonmonotonic logics with quantified Boolean formulas as constraints. We give quantified constraint versions of the constraint programming formalism of Marek, Nerode, and Remmel [15] and of the natural extension of their theory to default logic. We also introduce a new formalism which adds constraints to circumscription. We show ...
متن کاملA Logic of Partially Satisfied Constraints
Soft constraints are recognised as being important for many constraints applications. These include (a) over-constrained problems, where we cannot satisfy all the constraints, (b) situations where a constraint can be partially satisfied, so that there are degrees of satisfaction, and (c) where the identity of a constraint is uncertain, so that it can be uncertain whether a constraint is satisfi...
متن کاملAdding Constraints to Logic-based Formalisms
Constraints are predeened relations with a special implementation mechanism. Logic formalisms provide speciic reasoning facilities. We look at the eeect of adding constraints to existing logic-based executable formalisms, focussing on the semantics of the combined formalisms. We nd that in cases where this has been successful the operations of the formalism can be formulated logically and then ...
متن کامل